Generalized Arc Consistency for Global Cardinality Constraint
نویسنده
چکیده
A global cardinality constraint (gcc) is speci ed in terms of a set of variables X = fx1; :::; xpg which take their values in a subset of V = fv1; :::; vdg. It constrains the number of times a value vi 2 V is assigned to a variable in X to be in an interval [li; ci]. Cardinality constraints have proved very useful in many real-life problems, such as scheduling, timetabling, or resource allocation. A gcc is more general than a constraint of di erence, which requires each interval to be [0; 1]. In this paper, we present an e cient way of implementing generalized arc consistency for a gcc. The algorithm we propose is based on a new theorem of ow theory. Its space complexity is O(jXj jV j) and its time complexity is O(jXj jV j). We also show how this algorithm can e ciently be combined with other ltering techniques.
منابع مشابه
Improved Algorithm for the Soft Global Cardinality Constraint
We propose two algorithms achieving generalized arc consistency for the soft global cardinality constraint with variable-based violation and with value-based violation. They are based on graph theory and their complexity is O( √ nm) where n is the number of variables and m is the sum of the cardinalities of the domains. They improve previous algorithms that ran respectively in O(n(m+n log n)) a...
متن کاملThe extended global cardinality constraint: An empirical survey
The Extended Global Cardinality Constraint (EGCC) is a vital component of constraint solving systems, since it is very widely used to model diverse problems. The literature contains many different versions of this constraint, which trade strength of inference against computational cost. In this paper, I focus on the highest strength of inference usually considered, enforcing generalized arc con...
متن کاملThe Extended Global Cardinality Constraint: An Empirical Survey: Extended Abstract
The Extended Global Cardinality Constraint (EGCC) is an important component of constraint solving systems, since it is very widely used to model diverse problems. The literature contains many different versions of this constraint, which trade strength of inference against computational cost. In this paper, I focus on the highest strength of inference usually considered, enforcing generalized ar...
متن کاملArc Consistency for Global Cardinality Constraints with Costs
A global cardinality constraint (gcc) is speciied in terms of a set of variables X = fx1;:::;xpg which take their values in a subset of V = fv1;:::;vdg. It constrains the number of times each value vi 2 V is assigned to a variable in X to be in an interval li; ui]. A gcc with costs (costgcc) is a generalization of a gcc in which a cost is associated with each value of each variable. Then, each ...
متن کاملMaintaining Generalized Arc Consistency on Ad-Hoc n-Ary Boolean Constraints
Binary decision diagrams (BDDs) can compactly represent ad-hoc nary Boolean constraints. However, there is no generalized arc consistency (GAC) algorithm which exploit BDDs. For example, the global case constraint by SICStus Prolog for ad-hoc constraints is designed for nonBoolean domains. In this paper, we introduce a new GAC algorithm, bddc, for BDD constraints. Our empirical results demonstr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996